A Roadmap to Metacomputation by Supercompilation
نویسندگان
چکیده
This paper gives a gentle introduction to Turchin's super-compilation and its applications in metacomputation with an emphasis on recent developments. First, a complete supercompiler, including positive driving and generalization, is deened for a functional language and illustrated with examples. Then a taxonomy of related transformers is given and compared to the supercompiler. Finally, we put supercompila-tion into the larger perspective of metacomputation and consider three metacomputation tasks: specialization, composition, and inversion.
منابع مشابه
A Metacomputation Toolkit for a Subset of F] and Its Application to Software Testing Towards Metacomputation for the Masses
We present an on-going experiment to develop a practical metacomputation toolkit for F#. There are – apart from the better known supercompilation – other mature and potentially useful methods stemming from metacomputation theory: program inversion and tabulation, neighborhood analysis. Although implementations of these methods have existed since many years, they are typically experimental tools...
متن کاملMetasystem Transitions in Computer Science and Mathematics
We analyze MSTs, which may be observed, or are intentionally organized, in computer science and mathematics. These sciences are considered dealing with linguistic modeling. Various metasystems structures are revealed in activities of using the computer as a tool that makes linguistic models behaving by themselves, independently of their creator. The crucial role in automation of creating lingui...
متن کاملA Self-Applicable Supercompiler
A supercompiler is a program which can perform a deep transforma tion of programs using a principle which is similar to partial evaluation and can be referred to as metacomputation Supercompilers that have been in existence up to now see were not self applicable this is a more di cult problem than self application of a partial evaluator because of the more intricate logic of supercompilation In...
متن کاملMetacomputation as a Tool for Formal Linguistic Modeling
We consider the principle “a new model is a model of an existing one” as the main scheme for deriving new linguistic models by metacomputation. We derive the basic requirements for metacomputation by a structural analysis of different model definitions, and show that in order to automate the creation of linguistic models the following operations on linguistic models have to be performed by meta...
متن کاملAutomatic Verification of Counter Systems via Domain- Specific Multi-result Supercompilation Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation. Keldysh Automatic Verification of Counter Systems via Domain-specific Multi-result Supercompilation Moscow 2012
matic verification of counter systems via domain-specific multi-result supercompilation We consider an application of supercompilation to the analysis of counter transition systems. Multi-result supercompilation enables us to find the best versions of the analysis by generating a set of possible results that are then filtered according to some criteria. Unfortunately, the search space may be ra...
متن کامل